A comparison of initialization schemes for blind adaptive beamforming

نویسنده

  • Thomas E. Biedka
چکیده

Many blind adaptive beamforming algorithms require the selection of one or more non-zero initial weight vectors. Proper selection of the initial weight vectors can speed algorithm convergence and help ensure convergence to the desired solutions. Three alternative initialization approaches are compared here, all of which depend only on second order statistics of the observed data. These methods are based on Gram-Schmidt orthogonalization, eigendecomposition, and QR decomposition of the observed data covariance matrix. We show through computer simulation that the eigendecomposition approach yields the best performance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive beamforming in row-column addressed arrays for 3D ultrasound imaging

In recent years, to reduce the complexity of implementation, the use of 2D arrays with restricted row-column addressing has been considered for 3D ultrasound imaging. In this paper, two methods of adaptive beamforming based on the minimum variance method are represented in such a way that the computational load is much less than using the full adaptive beamforming method. In both proposed metho...

متن کامل

Beamforming Initialization and Data Prewhitening in Natural Gradient Convolutive Blind Source Separation of Speech Mixtures

Successful speech enhancement by convolutive blind source separation (BSS) techniques requires careful design of all aspects of the chosen separation method. The conventional strategy for system initialization in both timeand frequency-domain BSS involves a diagonal center-spike FIR filter matrix and no data preprocessing; however, this strategy may not be the best for any chosen separation alg...

متن کامل

The MSE performance of constant modulus receivers

The constant modulus algorithm (CMA) is an e ective technique for blind receiver design in practice. Treating CMA as a linear estimation problem, e ects of noise and channel conditions are investigated. For the class of channels with arbitary nite impulse responses, an analytical description of locations of constant modulus receivers and an upper bound of their mean squared errors (MSE) are der...

متن کامل

Adaptive Minimum Entropy Beamforming Algorithms for Narrowband Signals

Blind beamforming has been studied extensively in recent times. Array signal processing is an effective technique for signal extraction in communication systems. We employe minimum entropy deconvolution (MED) principle for source extraction. Results are shown which indicate good performance in comparison with conventional adaptive algorithms like the constant modulus algorithm and the multi-mod...

متن کامل

Multistage LSCMA Beamforming Algorithm for Smart Antenna with SMI initialization

The multistage LSCMA beamforming algorithm is capable of detecting multiple input signals sources without pilot or training signals. it is comprised of acascade of LSCM array subsections, eash of which captures one of the signals impinging on the array. An adaptative signal canceller folows each LSCM array to remove captured signal from the input before processing by subsequent section. We also...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998